Software Model for Determining the Optimal Routes in a Computer Network Based on the Two-Colonial Ant Algorithm

Purpose. At present, the computer networks of information and telecommunication system (ITS) railway transport use OSPF protocol, which does not allow taking into account several metrics when determining optimal route. Therefore, there is a need to study possibility organizing routing in rail ITS using two-colonial ant algorithm. Methodology. According Two-ACO software model, created Python language based on algorithm, route network was determined. model inputs: parameters (network adjacency matrix, number routers); algorithm (number iterations; ants colony; elite ants; initial pheromone level; evaporation rate; parameter for adjusting amount deposition). Findings. The results are presented form graphs depicting paths: criterion total delay routers (for first colony ants) hops second ants). Originality. 7 17 channels, time path by ordinary ants, rate deposited conducted. It determined that it enough equal have 2 colony, with 1000 iterations, from 0.2 0.7, deposition close one. Practical value. Created two colonies following criteria: make up allows you parallel determine routes transport. estimated 15 sufficient 30 agents (two top), value one, 0.4.